Revisiting Correlation-Immunity in Filter Generators
نویسندگان
چکیده
Correlation-immunity is a cryptographic criterion on Boolean functions arising from correlation attacks on combining functions. When it comes to filtering functions, the status of correlation-immunity lacks study in itself and, if it is commonly accepted as a requirement for nonlinear filter generators, this is for other concerns. We revisit the concept of correlation-immunity and clear up its meaning for filtering functions. We summarize existing criteria similar to correlation-immunity and attacks in two different models, showing that such criteria are not relevant in both models. We also derive a precise property to avoid correlations due to the filter function only, which appears to be a bit looser than correlation-immunity. We then propose new attacks based on whether this property is verified.
منابع مشابه
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of desig...
متن کاملResearch on Fault Location in Distributed Network with DG Based on Complex Correlation Thevenin Equivalent and Strong Tracking Filter
With the introduction of distributed generators (DG), the traditional distribution system characterized by radical network becomes a multi-source one. Therefore the accuracy of the equivalent model of distributed generators directly affects the precision of fault location. To solve this problem, this paper proposed a fault location method based on complex correlation Thevenin equivalent and str...
متن کاملOn the Influence of the Filtering Function on the Performance of Fast Correlation Attacks on Filter Generators
This paper presents a generalization of the fast correlation attack presented by Chepyshov, Johansson and Smeets at FSE 2000, for the particular case of filter generators. By considering not only the extremal Walsh coefficients of the filtering function but all the nonzero values in the Walsh spectrum, it is possible to significantly reduce the number of required running-key bits. Most notably,...
متن کاملSome Remarks on the Cross Correlation Analysis of Pseudo Random Generators
Siegenthaler has shown how cross-correlation techniques can be applied to identify pseudo random generators consisting of linear feedback shift registers and a scrambling function 171. These techniques may allow to attack one register in such a generator at a time. The original algorithm needs O(R2'N) operations to identify one register. ( r denotes the length of the register examined, R the nu...
متن کاملAlgebraic Immunity of S-Boxes and Augmented Functions
In this paper, the algebraic immunity of S-boxes and augmented functions of stream ciphers is investigated. Augmented functions are shown to have some algebraic properties that are not covered by previous measures of immunity. As a result, efficient algebraic attacks with very low data complexity on certain filter generators become possible. In a similar line, the algebraic immunity of the augm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007